Quantum search algorithm as an open system
نویسندگان
چکیده
We study the quantum search algorithm as an open system. More specifically, we analyze the responses of that algorithm to an external monochromatic field, and to the decoherences introduced by the measurement process. We find that the search algorithm is robust with respect to many external interactions.
منابع مشابه
OPTIMAL DESIGN OF SINGLE-LAYER BARREL VAULT FRAMES USING IMPROVED MAGNETIC CHARGED SYSTEM SEARCH
The objective of this paper is to present an optimal design for single-layer barrel vault frames via improved magnetic charged system search (IMCSS) and open application programming interface (OAPI). The IMCSS algorithm is utilized as the optimization algorithm and the OAPI is used as an interface tool between analysis software and the programming language. In the proposed algorithm, magnetic c...
متن کاملUsing Pattern Search Algorithm and Finite Element Method to Detect Rotor Cracks
The vibration pattern of a rotor system reflects the mechanical parameter changes in the system. Hence, the use of vibration monitoring is considered as a possible means of detecting the presence and growth of the cracks. In this paper, a pattern search based method for shaft crack detection is proposed and described which formulates the shaft crack detection as an optimization problem by means...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005